package collections;
import java.util.*;
public class QueueDemo {
    public static void printQ(Queue queue){
        while (queue.peek()!=null){
            System.out.println(queue.remove()+" ");
            }
        System.out.println();

    }
    public static void main(String[] args){
        Queue<Integer> queue = new LinkedList<>();
        Random rand =new Random(47);
        for(int i=0;i<10;i++){
            queue.offer(rand.nextInt(i+10));
        }
        printQ(queue);
        Queue<Character> qc = new LinkedList<>();
        for(char c:"Brontosaurus".toCharArray()){
            qc.offer(c);
        }
        printQ(qc);
    }
}
//先进先出规则FIFO:PriorityQueue
